منابع مشابه
Another note on countable Boolean algebras
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
متن کاملOn Finding Joint Subspace Boolean Matrix Factorizations
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel problem. Specifically, given two matrices, we want to find a set of factors shared by these two matrices and sets of factors specific for the matrices. Not only does such decomposition reveal what is common between the two ...
متن کاملA Note on Boolean Matrix Theory1
1. Introduction. Let U be a Boolean algebra of a t least two elements .
متن کاملOn the complexity of Boolean matrix ranks
We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute. This note is devoted to the functions of determinantal rank and fooling set number, which are receiving attention in different applications, see [1, 3] and references therein. The purpose of this note is to give an NP-completeness proof for those functions, th...
متن کاملA Note on Boolean Matrix Multiplication
A classical topic in computer science is matrix multiplication and Boolean Matrix Multiplication in particular. Most papers studying these problems present worst case algorithms with running times O(n 2+). For smaller these algorithms are rather complex and dii-cult to understand. As for several other problems the situation is not so bad if we consider random inputs. A natural probability model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90034-1